Iterative learning approaches to design finite-time consensus protocols for multi-agent systems

نویسندگان

  • Deyuan Meng
  • Yingmin Jia
چکیده

In this paper, the finite-time output consensus problem ofmulti-agent systems is considered by using the iterative learning control (ILC) approach. Two classes of distributed protocols are constructed from the two-dimensional system point of view (with time step and iteration number as independent variables), and are termed as iterative learning protocols. If learning gains are chosen appropriately, then all agents in a directed graph can be enabled to achieve finite-time consensus with the iterative learning protocols. Moreover, all agents in a directed graph can be guaranteed to reach finite-time consensus at any desired terminal output if the iterative learning protocols are improved by introducing the desired terminal output to some (not necessarily all) of the agents. Simulation results are finally presented to illustrate the performance and effectiveness of our iterative learning protocols. © 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Consensus Control for a Class of Non-affine MIMO Strict-Feedback Multi-Agent Systems with Time Delay

In this paper, the design of a distributed adaptive controller for a class of unknown non-affine MIMO strict-feedback multi agent systems with time delay has been performed under a directed graph. The controller design is based on dynamic surface control  method. In the design process, radial basis function neural networks (RBFNNs) were employed to approximate the unknown nonlinear functions. S...

متن کامل

Distributed Design of Finite-time Average Consensus Protocols

In this paper, we are interested in the finite-time average consensus problem for multi-agent systems or wireless sensor networks. This issue is formulated in a discrete-time framework by utilizing a linear iteration scheme, where each node repeatedly updates its value as a weighted linear combination of its own value and those of its neighbors. Unlike most of research in literature, this work ...

متن کامل

Optimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics

In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

متن کامل

Finite-time Consensus for Nonlinear Multi-agent Systems with Fixed Topologies

In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a consensus in finite time, provided that the underlying directed network contains a spanning tree. Novel finite-time consensus protocols are introduced as examples ...

متن کامل

A finite-time consensus protocol of the multi-agent systems

According to conjugate gradient algorithm, a new consensus protocol algorithm of discrete-time multi-agent systems is presented, which can achieve finite-time consensus. Finally, a numerical example is given to illustrate our theoretical result. Keywords—Consensus protocols; Graph theory; Multi-agent systems; Conjugate gradient algorithm; Finite-time.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Systems & Control Letters

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2012